Linguistic Truth-value Lattice-valued Logic System with Important Coefficient and Its Application to Evaluation System

نویسندگان

  • Dan Meng
  • Huading Jia
  • Zaiqiang Zhang
  • Yang Xu
چکیده

In this paper, a linguistic truth-value lattice proposition logic system LTV LP (X) is presented firstly. It is an useful and reasonable tool to deal with the linguistic term set including linear ordered set and non-linear ordered set. Then an operator linguistic truth-value lattice-valued proposition logic OLTV LP (X) is given. The OLTV LP (X) can provide a theoretical model for multi-evaluator single-layer evaluation problem with linguistic term set. Then it follows an evaluation approach in LTV LP (X) and OLTV LP (X) by using logic formula for an application case. Any linear information and incomparable information can be dealt with in the framework under LTV LP (X) and OLTV LP (X).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Double-layer Modificatory Linguistic Truth-value Lattice-valued Evaluation Method

In this paper, a double-layer modificatory linguistic truth-value lattice-valued evaluation method is presented. Its logic basic is based on modificatory linguistic truth-value lattice-valued proposition logic system MLTVLP(X) and operator modificatory linguistic truth-value lattice-valued proposition logic OMLTVLP(X). MLTVLP(X) and OMLTVLP(X) are similar to LTVLP(X) and MLTVLP(X), which have b...

متن کامل

TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS

In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...

متن کامل

Determination of α -Resolution for Lattice-Valued First-Order Logic Based on Lattice Implication Algebra

As a continuation of our research work on resolutionbased automated reasoning approaches for latticevalued logic systems with truth-values in a latticevalued logical algebraic structure – lattice implication algebra (LIA), in the present paper, we prove thatα resolution for lattice-valued first-order logic ( ) LF X based on LIA can be equivalently transformed into that for lattice-valued propos...

متن کامل

A Linguistic Truth-Valued Temporal Reasoning Formalism and Its Implementation

Temporality and uncertainty are important features of many real world systems. Solving problems in such systems requires the use of formal mechanism such as logic systems, statistical methods or other reasoning and decision-making methods. In this paper, we propose a linguistic truth-valued temporal reasoning formalism to enable the management of both features concurrently using a linguistic tr...

متن کامل

Resolution Method in Linguistic Propositional Logic

In the present paper, the resolution method for a linguistic propositional logic with truth value in a logical algebra refined hedge algebra, is focused. The preliminaries of refined hedge algebra are given first. Then the syntax and semantic of linguistic propositional are defined. Finally, a resolution method which based on resolution principle in two-valued logic is established. Accordingly,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006